Cuckoo Matrix: A High Efficient and Accurate Graph Stream Summarization on Limited Memory

The graph stream is defined as rapid edge streams on a huge domain of nodes. Nowadays, play important roles in network traffic, social networks, and cloud troubleshooting. Therefore, various summary structures for are proposed to obtain approximate evaluation results. However, these either sacrifice accuracy guaranteed throughput or compromise memory consumption high precision. In view the limitations, we propose Cuckoo Matrix. It only uses one adjacency matrix complete queries while assuring large throughput. Meanwhile, Matrix capable preserving connectivity edges purpose supporting both structural weight-based estimations. experimental results show that improves insertion by 25% reduces compared state-of-the-art, which meets current requirements summarization.